Assertion - Based Program Veri cation Using A Constraint
نویسندگان
چکیده
An important goal in the area of reliable software is to show that a program actually meets its speciications. This can be done using program veriication techniques. Assertions are made about the expected behavior of a program, and intermediate program states are examined to ensure that the speciications of the program are never violated. However, proving that the intermediate program steps lead to the conclusion and, therefore, proving that the program is correct is diicult. In this paper we show how a constraint logic programming tool, CLP(R), can be used to help in determining whether the given pre-and postconditions of a program proof match the actual statement that is supposed to be performed. In addition to that, CLP(R) was used as part of a weakest precondition generator which was used to ll in program proofs that were incomplete .
منابع مشابه
Tracing the Origins of Verification Conditions
The typical program veri cation system is a batch tool that accepts as input a program annotated with Floyd-Hoare assertions, performs syntactic and semantic analysis on it, and generates a list of veri cation conditions that is subsequently submitted to a theorem prover. When a veri cation condition cannot be proved, this may be due to an error in the program or an inconsistency in the annotat...
متن کاملA Systematic Approach to Parallel Program Veri cation
In this paper we investigate parallel program veri cation with directed graphs and assertion matrices. The parallel computational model is that with shared variables and each comprising process runs asynchronously. A program graph is a direct product of the owcharts of comprising processes. The vertices of the graph correspond to global control points of the given parallel program, and edges co...
متن کاملToward a Provably Correct Implementation of the JVM Bytecode Veri er
This paper reports on our ongoing e orts to realize a provably correct implementation of the Java Virtual Machine bytecode veri er We take the perspective that bytecode veri cation is a data ow analysis problem or more generally a constraint solving prob lem on lattices We employ Specware a system available from Kestrel Institute that supports the development of programs from speci cations to f...
متن کاملConstraint-Based Timetabling-A Case Study
This paper reports a case study in applying Constraint-Satisfaction techniques to university and school timetabling. It involves the construction of a substantial, carefully speci ed, fully tested and fully operational system. The software engineering aspect of Constraint-Satisfaction is emphasized in this paper. Constraint-Satisfaction problems are expressed in a language more familiar to the ...
متن کاملTracing the Origins of Veri cation Conditions
The typical program veriication sytem is a batch tool that accepts as input a program annotated with Floyd-Hoare assertions, perr forms syntactic and semantic analysis on it, and generates a list of verii cation conditions that is subsequently submitted to a theorem prover. When a veriication condition cannot be proved, this may be due to an error in the program or an inconsistency in the annot...
متن کامل